منابع مشابه
Studies of Three-Body B^+→D ̅^* 〖(2007)〗^0 K^+ K ̅^0 and B^0→D^* 〖(2010)〗^- K^+ K ̅^0 Decays
We analyze three-body decays of and . Under the factorization approach, there are tree level diagrams for these decay modes and the transition matrix element of decay is factorized into a form factor multiplied by decay constant and form factor multiplied into weak vertices form factor. The transition matrix element of decay is also factorized into a form factor multiplied into weak vertic...
متن کاملDispersive Ordering and k-out-of-n Systems
Extended Abstract. The simplest and the most common way of comparing two random variables is through their means and variances. It may happen that in some cases the median of X is larger than that of Y, while the mean of X is smaller than the mean of Y. However, this confusion will not arise if the random variables are stochastically ordered. Similarly, the same may happen if one would like to ...
متن کاملOptimal Geometric Partitions, Covers and K-Centers
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the techniques we present have immediate applications to several cost optimization and facility location problems which are quite common in practice. The main technique...
متن کاملComputing the k-covers of a string
Given a string x of length n and an integer constant k, the k-Cover Problem is defined to be the identification of all the sets of k substrings each of equal length that cover x. This problem can be solved by a general algorithm in OðnÞ time for constant alphabet size. We also generalize the k-Cover Problem, whereby a set of k substrings of different lengths are considered, which can be compute...
متن کاملSigned (b, k)-Edge Covers in Graphs
Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and b are positive integers. A function is said to be a signed -edge cover of G if G ( ) V G ( ) e E v ( ) E G G : ( f E k b k ) { 1,1} G ( , ) b k ( ) f e b for at least vertices of , where . The value k v G ( ) = {uv E( ( ) E v G u N v ) | } ( ) min ( ) G e E f e , taki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2006
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-006-0014-8